Projective diagrams of interlocking sequences

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequences of n-Diagrams

We consider only computable languages, and countable structures, with universe a subset of ω, which we think of as a set of constants. We identify sentences with their Gödel numbers. Thus, for a structure A, the complete (elementary) diagram, Dc(A), and the atomic diagram, D(A), are subsets of ω. We classify formulas as usual. A formula is both Σ0 and Π0 if it is open. For n > 0, a formula, in ...

متن کامل

Further remarks on systems of interlocking exact sequences

In a system of interlocking sequences, the assumption that three out of the four sequences are exact does not guarantee the exactness of the fourth. In [1], Hilton proved that, with the additional condition that it is differential at the crossing points, the fourth sequence is also exact. In this paper, we trace such a diagram and analyze the relation between the kernels and the images, in the ...

متن کامل

Equivalence of Graded Module Braids and Interlocking Sequences

The category of totally ordered graded module braids and that of the exact interlocking sequences are shown to be equivalent. As an application of this equivalence, we show the existence of a connection matrix for a totally ordered graded module braid without assuming the existence of chain complex braid that induces the given graded module braid.

متن کامل

Generating Test Sequences from UML Sequence Diagrams and State Diagrams

UML models offer a lot of information that should not be ignored in testing. By combining different UML components, different views of the program under test are used. The paper concentrates on a technique for generating test cases from a combination of UML sequence and state diagrams. The main information is extracted from sequence diagrams, which is complemented by initialization sequences fo...

متن کامل

Voronoï diagrams in projective geometry and sweep circle algorithms for constructing circle-based voronoï diagrams

The sweep circle algorithm is based on the concept of wavefront developed by Dehne and Klein [Dehne, 1997]. In this case, because the sweep line is a site of the same nature as the sites being considered, we get an economy of scale for the objects to be treated. It uses the definition of a Voronoï diagram in projective geometry to simplify the treatment of the non-connected wavefront and vertex...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Illinois Journal of Mathematics

سال: 1971

ISSN: 0019-2082

DOI: 10.1215/ijm/1256052612